The Mythological Background of Homer: The Eternal Return of Killing Dragons
نویسنده
چکیده
منابع مشابه
Immortality in the Great Religions and Myths of Iran, Mesopotamia, Sumer, and Greece
In every mythological story, a quest for immortality and eternality depicts man’s inner fervor for unity with gods and the supreme power. Man seeks full immersion in life and longs for immortality at the same time. In other words, he wants to live both in time and in eternity. The desire for eternity in man shows his ceaseless struggle with time, and even more so an intense fight with death to ...
متن کاملنقش و مفهوم اژدها در بافته های ایران و چین با تأکید بر دوره صفوی ایران و اواخر دوره مینگ و اوایل چینگ چین
The Iranian textures in the Safavid era are associated with some phenomena such as symbolism and myth. These textures contain some motifs that indicate the beliefs and ideas of the Iranian people, and these motifs have preserved the concepts over time. The dragon is one of these symbolic motifs whose presence can be traced back to the oldest literary sources in Iran's history. Dragon is referre...
متن کاملThe Nietzschean Verification of the Missing God and Steps to a Completest Self
This paper aims to present Friedrich Nietzsche’s critique of Christianity as a Western example that reconfirms the necessity for man’s inner development up to the stage of the Completest Self (nafs-i safiyya). With the advent of Christianity and the resultant triumph of its “morality of slave” (1886, sec. 260), the “death of God” (1882) becomes the “fundamental event of Western history” and its...
متن کاملEternal m-security subdivision numbers in graphs
An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017